Dynamic Mobile User Location Update for Wireless Pcs 18 0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2 2.4 2.6 2.8 3.0 3.2 3.4 P Nc

This article described analytic approaches in developing practical models for large-scale PCS networks, Based on the ow equivalent assumption (the rate of portables move into a cell equals to the rate of portables move out of the cell), a portable population model was described. The model provides the steady-state portable population distribution in a cell which is independent of the portable residence time distribution, which can be used by simulations to reduce the necessary execution time by reaching the steady state more rapidly. Additionally, this model can be used to study the blocking probability of low (portable) mobility PCS network and the performance of portable de-registration strategies. Then we describe a model for portable movement. The model assumes that the arrival calls to a portable form a Poisson process, and portable residence times have a general distribution. This model can be used to study location tracking algorithms and hand-oo algorithms. We showed that under some assumptions, the analytic techniques are consistent with the simulation experiments. Acknowledgement Ian Akyildiz provided valuable comments that have signiicantly improved the quality of this paper. Figure 5: The comparison of p nc for the analytic results and the simulation results (equals to the call completion rate, and the number of channels in a cell is 10) 17 call is completed. The call is referred to as a K-hand-oo call. If we modify our portable movement model such that t c represents a call holding time (and is replaced by in (6)), then (K) is the probability of a K-hand-oo call. For a K-hand-oo call, let J be the number of portable moves before the call is blocked or successfully terminated, where J K. The probability (K) can be used to derive the expected number EJ]. The idea is the following. We rst express the conditional probability PrrJ = jjK = k] as a function of p f. Then PrrJ = jjK = k] is used to derive EJjK = k], the expected number of J for a k-hand-oo call.